A Heuristic for Boundedness of Ranks of Elliptic Curves

نویسندگان

  • JENNIFER PARK
  • BJORN POONEN
  • JOHN VOIGHT
چکیده

We present a heuristic that suggests that ranks of elliptic curves E over Q are bounded. In fact, it suggests that there are only finitely many E of rank greater than 21. Our heuristic is based on modeling the ranks and Shafarevich–Tate groups of elliptic curves simultaneously, and relies on a theorem counting alternating integer matrices of specified rank. We also discuss analogues for elliptic curves over other global fields.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Silverman's conjecture for a family of elliptic curves

Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...

متن کامل

RANKS OF QUADRATIC TWISTS OF ELLIPTIC CURVES by

— We report on a large-scale project to investigate the ranks of elliptic curves in a quadratic twist family, focussing on the congruent number curve. Our methods to exclude candidate curves include 2-Selmer, 4-Selmer, and 8-Selmer tests, the use of the Guinand-Weil explicit formula, and even 3-descent in a couple of cases. We find that rank 6 quadratic twists are reasonably common (though stil...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

Complete characterization of the Mordell-Weil group of some families of elliptic curves

 The Mordell-Weil theorem states that the group of rational points‎ ‎on an elliptic curve over the rational numbers is a finitely‎ ‎generated abelian group‎. ‎In our previous paper, H‎. ‎Daghigh‎, ‎and S‎. ‎Didari‎, On the elliptic curves of the form $ y^2=x^3-3px$‎, ‎‎Bull‎. ‎Iranian Math‎. ‎Soc‎.‎‎ 40 (2014)‎, no‎. ‎5‎, ‎1119--1133‎.‎, ‎using Selmer groups‎, ‎we have shown that for a prime $p...

متن کامل

A Discursus on 21 as a Bound for Ranks of Elliptic Curves over Q, and Sundry Related Topics

In the last paragraph of [31, §4], it was mentioned that a “forthcoming paper” of the author and A. Granville would give (heuristic) weight to the idea that (particularly if one ignores arithmetic issues) the number of curves of height up to X with rank r should be bounded by X(21−r)/24+ for r ≥ 1. Some related ideas appeared in [33, §11], while herein we shall speak more directly of the genera...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016